Parallel Hybrid Algorithms for a Finite Family of G-Nonexpansive Mappings and Its Application in a Novel Signal Recovery

This article considers a parallel monotone hybrid algorithm for finite family of G-nonexpansive mapping in Hilbert spaces endowed with graphs and suggests iterative schemes finding common fixed point by the two different projection methods. Moreover, we show computational performance our comparison to some Strong convergence theorems are proved under suitable conditions. Finally, give numerical experiments algorithms efficiency implementation LASSO problems signal recovery types blurred matrices noise.